A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
نویسندگان
چکیده
منابع مشابه
The Minimum Euclidean-Norm Point on a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential
The complexity of Philip Wolfe’s method for the minimum Euclidean-norm point problem over a convex polytope has remained unknown since he proposed the method in 1974. We present the first example that Wolfe’s method has exponential behavior under a natural ‘pivot’ rule. Additionally, we improve previous results to show that linear programming reduces in strongly-polynomial time to the minimum n...
متن کاملA Recursive Algorithm for Finding the Minimum Norm Point in an Unbounded Polyhedron
We present a recursive algorithm for finding the minimum norm point in an unbounded, wnvex and pointed polyhedron defined by finite sets of points and rays. The algorithm can start at an arbitrary point of the polyhedron and does not require to solve systems of linear equations.
متن کاملFinding the nearest point in A polytope
A terminating algorithm is developed for the problem of finding the point of smallest Euclidean norm in the convex hull of a given finite point set in Euclidean n-space, or equivalently for finding an "optimal" hyperplane separating a given point from a given finite point set. Its efficiency and accuracy are investigated, and its extension to the separation of two sets and other convex programm...
متن کاملA note on the Minimum Norm Point algorithm
We present a provably more efficient implementation of the Minimum Norm Point Algorithm conceived by Fujishige than the one presented in [FUJI06]. The algorithm solves the minimization problem for a class of functions known as submodular. Many important functions, such as minimum cut in the graph, have the so called submodular property [FUJI82]. It is known that the problem can also be efficien...
متن کاملFinding Minimum Norm Fixed Point of Nonexpansive Mappings and Applications
Iterative algorithms for finding fixed point of nonexpansive mappings are very interesting topic due to the fact that many nonlinear problems can be reformulated as fixed point equations of nonexpansive mappings. Related works can be found in 1–32 . On the other hand, we notice that it is quite often to seek a particular solution of a given nonlinear problem, in particular, the minimum-norm sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1990
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.33.188